Successful Logic Programs
نویسندگان
چکیده
We formalize the intuitive reasoning which we normally use to get convinced that a query has successful LD-derivations in a program. We give two suucient conditions: one for characterizing absence of nitely failing LD-derivations (FDs) and a weaker one for guaranteeing the presence of at least one successful LD-derivation if there are nite ones. These conditions can be useful both in verifying properties of logic programs and in program transformation.
منابع مشابه
Universit a Di Pisa on Logic Programs That Do Not Fail on Logic Programs That Do Not Fail
This paper investigates the advantages of reasoning on logic programs and queries that have only successful derivations. We consider an extension of the logic programming paradigm that combines guarded clauses, in the style of concurrent logic languages, and dynamic selection rules. Some general conditions for a class of programs and queries are stated, which characterize when successful deriva...
متن کاملConstructive Negation and Constraints
Inclusion of negation into logic programs is considered traditionally to be painful as the incorporation of full logic negation tends to super-exponential time complexity of the prover. Therefore the alternative approaches to negation in logic programs are studied and among them, the procedural negation as failure sounds to be the most successful and the most widely used. However, Constraint Lo...
متن کاملAlgebraic Approach to Causal Logic Programs
Answer Set Programming (ASP), a paradigm based on the stable model semantics, has become one of the most successful formalisms for knowledge representation in Artificial Intelligence. Causal logic programs are an extension of ASP whose goal is to reason about the causes that justify derived facts.
متن کاملPDL with Negation of Atomic Programs
Propositional dynamic logic (PDL) is one of the most successful variants of modal logic. To make it even more useful for applications, many extensions of PDL have been considered in the literature. A very natural and useful such extension is with negation of programs. Unfortunately, as long-known, reasoning with the resulting logic is undecidable. In this paper, we consider the extension of PDL...
متن کاملFormal Derivation of CSP Programs
The algebra of relations has been very successful for reasoning about possibly non-deterministic programs, provided their behaviour can be fully characterized by just their initial and nal states. We use a slight generalization, called sequential algebra, to extend the scope of relation-algebraic methods to reactive systems, where the behaviour between initiation and termination is also importa...
متن کامل